Non%2Dgoal scene analysis for soccer video.

Constrained Metric Learning Via Distance Gap Maximization.

Large%2Dscale Dictionary Learning For Local Coordinate Coding.

Discriminative Hessian Eigenmaps for face recognition.

m%2DSNE Multiview Stochastic Neighbor Embedding.

Backward%2DForward Least Angle Shrinkage for Sparse Quadratic Optimization.

Random Projection Tree and Multiview Embedding for Large%2DScale Image Retrieval.

Semi%2Dsupervised sparse metric learning using alternating linearization optimization.

Feature Extraction for fMRI%2DBased Human Brain Activity Recognition.

Dual Phase Learning for Large Scale Video Gait Recognition.

A novel image quality metric based on morphological component analysis.



Chinese text detection and location for images in multimedia messaging service.

Manifold Elastic Net A Unified Framework for Sparse Dimension Reduction

NESVM a Fast Gradient Method for Support Vector Machines

A Video Quality Assessment Metric Based on Human Visual System.

Local Feature Based Geometric%2DResistant Image Information Hiding.

Bregman Divergence%2DBased Regularization for Transfer Subspace Learning.

Color to Gray Visual Cue Preservation.

Biased Discriminant Euclidean Embedding for Content%2DBased Image Retrieval.

Active Reranking for Web Image Search.

Evolutionary Cross%2DDomain Discriminative Hessian Eigenmaps.

On combining morphological component analysis and concentric morphology model for mammographic mass detection.

An integrated aurora image retrieval system AuroraEye.

Subspace Learning.
In a cognitive vision system, learning is expected to be a continuous process, which treats input images and pixels selectively. In this paper we present a method for subspace learning, which takes these considerations into account. First, we present a generalized PCA approach, which estimates the principal subspace considering weighted pixels and images. Next, we propose a method for incremental learning, which sequentially updates the principal subspace. Finally, we combine these two techniques into a unified method for weighted incremental subspace learning.
Semi%2Dsupervised Gaussian process latent variable model with pairwise constraints.



Incremental tensor biased discriminant analysis A new color%2Dbased visual tracking method.

Photo%2Dsketch synthesis and recognition based on subspace learning.

Biologically inspired feature manifold for gait recognition.

Incremental pairwise discriminant analysis based visual tracking.

A survey of graph edit distance.

Local histogram based geometric invariant image watermarking.

A multi%2Dframe image super%2Dresolution method.

A Novel Visual Organization Based on Topological Perception.

Retrieval based interactive cartoon synthesis via unsupervised bi%2Ddistance metric learning.

The Gabor%2DBased Tensor Level Set Method for Multiregional Image Segmentation.

Embedded Geometric Active Contour with Shape Constraint for Mass Segmentation.

Ensemble manifold regularization.

A fast feature extraction method.
This paper proposes a method for sign language recognition that bypasses the need for tracking by classifying the motion directly. The method uses the natural extension of haar like features into the temporal domain, computed efficiently using an integral volume. These volumetric features are assembled into spatio-temporal classifiers using boosting. Results are presented for a fast feature extraction method and 2 different types of boosting. These configurations have been tested on a data set consisting of both seen and unseen signers performing 5 signs producing competitive results. 1
Dirichlet Mixture Allocation for Multiclass Document Collections Modeling.

Cross%2DDomain Web Image Annotation.

Object trajectory clustering via tensor analysis.

A global%2Dto%2Dlocal scheme for imbalanced point matching.

Discrminative Geometry Preserving Projections.

Detecting image points of general imbalance.

A convergent solution to two dimensional linear discriminant analysis.

Biased isomap projections for interactive reranking.

Transfer Discriminative Logmaps.

Texture Representation in AAM using Gabor Wavelet and Local Binary Patterns.

Incremental Learning of Weighted Tensor Subspace for Visual Tracking.

Manifold Elastic Net for Sparse Learning.

An Unsupervised Feature Ranking Scheme by Discovering Biclusters.

Robust Semantic Concept Detection in Large Video Collections.

A Comparative Study of Three Graph Edit Distance Algorithms.

Biologically Inspired Tensor Features.

Introduction to computer vision and image understanding the special issue on video analysis.

Discriminative optical flow tensor for video semantic analysis.

Binary Sparse Nonnegative Matrix Factorization.

Patch Alignment for Dimensionality Reduction.

Geometric Mean for Subspace Selection.

Image Quality Assessment Based on Multiscale Geometric Analysis.

Fast Haar transform based feature extraction for face representation and recognition.

Gabor texture in active appearance models.

Learning semantics from multimedia content.

Shot%2Dbased video retrieval with optical flow tensor and HMMs.

Introduction to the special issue on Video%2Dbased Object and Event Analysis.

Reversibility improved lossless data hiding.

Visual information analysis for security.

A natural image quality evaluation metric.

A local Tchebichef moments%2Dbased robust image watermarking.

A new approach for face recognition by sketches in photos.

Enhanced biologically inspired model.

Semantic Video Shot Segmentation Based on Color Ratio Feature and SVM.

Invariant Image Watermarking Based on Local Feature Regions.

Discriminative Locality Alignment.
Linear Discriminant Analysis (LDA) is a well-known scheme for supervised subspace learning. It has been widely used in the applications of computer vision and pattern recognition. However, an intrinsic limitation of LDA is the sensitivity to the presence of outliers, due to using the Frobenius norm to measure the inter-class and intra-class distances. In this paper, we propose a novel rotational invariant L1 norm (i.e., R1 norm) based discriminant criterion (referred to as DCL1), which better characterizes the intra-class compactness and the inter-class separability by using the rotational invariant L1 norm instead of the Frobenius norm. Based on the DCL1, three subspace learning algorithms (i.e., 1DL1, 2DL1, and T DL1) are developed for vector-based, matrix-based, and tensor-based representations of data, respectively. They are capable of reducing the influence of outliers substantially, resulting in a robust classification. Theoretical analysis and experimental evaluations demonstrate the promise and effectiveness of the proposed DCL1 and its algorithms.
Transductive Component Analysis.
Abstract. This paper describes a novel framework for learning discriminative features, where both labeled and unlabeled data are used to map the data instances to a lower dimensional space, preserving both class separability and data manifold topology. In contrast to linear discriminant analysis (LDA) and its variants (like semi-supervised discriminant analysis), which can only return c−1featuresforaproblemwithc classes, the proposed approach can generate d features, where d is bounded only by the dimensionality of the original problem. The proposed framework can be used with both two class and multiple class problems. It can also be adapted to problems where class labels are continuous. We describe and evaluate the new approach both theoretically and experimentally, and compare its performance with other state of the art methods.
An image quality assessment metric based contourlet.

Geometrically invariant watermarking using affine covariant regions.

C1 units for scene classification.

Harmonic mean for subspace selection.

Bayesian tensor analysis.

A unifying framework for spectral analysis based dimensionality reduction.

Effective video event detection via subspace projection.

Which Components are Important for Interactive Image Searching%3F

Bayesian Tensor Approach for 3%2DD Face Modeling.

Modality Mixture Projections for Semantic Video Event Detection.

Binary Two%2DDimensional PCA.

Local Coordinates Alignment %28LCA%29 a Novel Manifold Learning Approach.

Gait Components and Their Application to Gender Recognition.

Local Coordinates Alignment %28LCA%29 a Novel Manifold Learning Approach.

Neurocomputing for vision research.

Tensor Rank One Discriminant Analysis %2D A convergent method for discriminative multilinear subspace selection.

Local face sketch synthesis learning.

Visual music and musical vision.

Wavelet%2Dbased contourlet in quality evaluation of digital images.

Avatar motion control by natural body movement via camera.

Image categorization Graph edit distance edge direction histogram.

Multimodal biometrics using geometry preserving projections.

KPCA for semantic object extraction in images.

Multimodal biometrics using geometry preserving projections.



General Averaged Divergence Analysis.

Local Coordinates Alignment and Its Linearization.

Probabilistic Tensor Analysis with Akaike and Bayesian Information Criteria.

Gender recognition based on local body motions.

Negative Samples Analysis in Relevance Feedback.

Marginal Fisher Analysis and Its Variants for Human Gait Recognition and Content%2D Based Image Retrieval.

General Tensor Discriminant Analysis and Gabor Features for Gait Recognition.

Marginal Fisher Analysis and Its Variants for Human Gait Recognition and Content%2D Based Image Retrieval.

A Similarity Metric in Image Searching.

Face Recognition %2D a Generalized Marginal Fisher Analysis Approach.

Supervised tensor learning.
This paper aims to take general tensors as inputs for supervised learning. A supervised tensor learning (STL) framework is established for convex optimization based learning techniques such as support vector machines (SVM) and minimax probability machines (MPM). Within the STL framework, many conventional learning machines can be generalized to take n th –order tensors as inputs. We also study the applications of tensors to learning machine design and feature extraction by linear discriminant analysis (LDA). Our method for tensor based feature extraction is named the tenor rank–one discriminant analysis (TR1DA). These generalized algorithms have several advantages: 1) reduce the curse of dimension problem in machine learning and data mining; 2) avoid the failure to converge; and 3) achieve better separation between the different categories of samples. As an example, we generalize MPM to its STL version, which is named the tensor MPM (TMPM). TMPM learns a series of tensor projections iteratively. It is then evaluated against the original MPM. Our experiments on a binary classification problem show that TMPM significantly outperforms the original MPM. 1.
Human Carrying Status in Visual Surveillance.
A person’s gait changes when he or she is carrying an object such as a bag, suitcase or rucksack. As a result, human identification and tracking are made more difficult because the averaged gait image is too simple to represent the carrying status. Therefore, in this paper we first introduce a set of Gabor based human gait appearance models, because Gabor functions are similar to the receptive field profiles in the mammalian cortical simple cells. The very high dimensionality of the feature space makes training difficult. In order to solve this problem we propose a general tensor discriminant analysis (GTDA), which seamlessly incorporates the object (Gabor based human gait appearance model) structure information as a natural constraint. GTDA differs from the previous tensor based discriminant analysis methods in that the training converges. Existing methods fail to converge in the training stage. This makes them unsuitable for practical tasks. Experiments are carried out on the USF baseline data set to recognize a human’s ID from the gait silhouette. The proposed Gabor gait incorporated with GTDA is demonstrated to significantly outperform the existing appearance-based methods. 1.
Beyond streams and graphs dynamic tensor analysis.
How do we find patterns in author-keyword associations, evolving over time? Or in DataCubes, with product-branchcustomer sales information? Matrix decompositions, like principal component analysis (PCA) and variants, are invaluable tools for mining, dimensionality reduction, feature selection, rule identification in numerous settings like streaming data, text, graphs, social networks and many more. However, they have only two orders, like author and keyword, in the above example. We propose to envision such higher order data as tensors, and tap the vast literature on the topic. However, these methods do not necessarily scale up, let alone operate on semi-infinite streams. Thus, we introduce the dynamic tensor analysis (DTA) method, and its variants. DTA provides a compact summary for high-order and high-dimensional data, and it also reveals the hidden correlations. Algorithmically, we designed DTA very carefully so that it is (a) scalable, (b) space efficient (it does not need to store the past) and (c) fully automatic with no need for user defined parameters. Moreover, we propose STA, a streaming tensor analysis method, which provides a fast, streaming approximation to DTA. We implemented all our methods, and applied them in two real settings, namely, anomaly detection and multi-way latent semantic indexing. We used two real, large datasets, one on network flow data (100GB over 1 month) and one from DBLP (200MB over 25 years). Our experiments show that our methods are fast, accurate and that they find interesting patterns and outliers on the real datasets. 1.
Human Gait Recognition With Matrix Representation.
Abstract—Human gait is an important biometric feature. It can be perceived from a great distance and has recently attracted greater attention in video-surveillance-related applications, such as closed-circuit television. We explore gait recognition based on a matrix representation in this paper. First, binary silhouettes over one gait cycle are averaged. As a result, each gait video sequence, containing a number of gait cycles, is represented by a series of gray-level averaged images. Then, a matrix-based unsupervised algorithm, namely coupled subspace analysis (CSA), is employed as a preprocessing step to remove noise and retain the most representative information. Finally, a supervised algorithm, namely discriminant analysis with tensor representation, is applied to further improve classification ability. This matrix-based scheme demonstrates a much better gait recognition performance than state-of-the-art algorithms on the standard USF HumanID Gait database. Index Terms—Coupled subspaces analysis (CSA), dimensionality reduction, discriminant analysis with tensor representation (DATER), human gait recognition, object representation. I.
Asymmetric Bagging and Random Subspace for Support Vector Machines%2DBased Relevance Feedback in Image Retrieval.

Multitraining Support Vector Machine for Image Retrieval.

Direct Kernel Biased Discriminant Analysis A New Content%2DBased Image Retrieval Relevance Feedback Algorithm.

Artistic Mosaic Series Generation.

Supervised Tensor Learning.
This paper aims to take general tensors as inputs for supervised learning. A supervised tensor learning (STL) framework is established for convex optimization based learning techniques such as support vector machines (SVM) and minimax probability machines (MPM). Within the STL framework, many conventional learning machines can be generalized to take n th –order tensors as inputs. We also study the applications of tensors to learning machine design and feature extraction by linear discriminant analysis (LDA). Our method for tensor based feature extraction is named the tenor rank–one discriminant analysis (TR1DA). These generalized algorithms have several advantages: 1) reduce the curse of dimension problem in machine learning and data mining; 2) avoid the failure to converge; and 3) achieve better separation between the different categories of samples. As an example, we generalize MPM to its STL version, which is named the tensor MPM (TMPM). TMPM learns a series of tensor projections iteratively. It is then evaluated against the original MPM. Our experiments on a binary classification problem show that TMPM significantly outperforms the original MPM. 1.
Stable Third%2DOrder Tensor Representation for Color Image Classification.

Kernel Principle Component Analysis in Pixels Clustering.

K%2DBOX a query%2Dby%2Dsinging based music retrieval system.


Multi%2DClass Discriminant Learning For Image Retrieval.

Learning User%27s Perception Using Region%2Dbased SVM for Content%2Dbased Image Retrieval.


Random Sampling Based SVM for Relevance Feedback Image Retrieval.

Texture classification of sars infected region in radiographic image.

Kernel full%2Dspace biased discriminant analysis.

SVM%2Dbased relevance feedback using random subspace method.

Nonparametric Discriminant Analysis in Relevance Feedback for Content%2DBased Image Retrieval.

